Creating 3-dimensional graph structures with DNA
نویسندگان
چکیده
We propose solving computational problems with DNA molecules by physically constructing 3-dimensional graph structures. Building blocks consisting of intertwined strands of DNA are used to represent graph edges and vertices. Diierent blocks would be combined to form all possible 3-dimensional structures representing a graph. The solution to the Hamiltonian cycle problem provided requires a constant number of steps regardless of the number of vertices. If a solution to the graph problem exists, then a fully closed circular molecule would be formed and can be isolated. This paper introduces a method of using 3D structures in computing which might signiicantly improve the eeciency of computations with DNA.
منابع مشابه
Three Dimensional DNA Structures in
We show that 3-dimensional graph structures can be used for solving computational problems with DNA molecules. Vertex building blocks consisting of k-armed (k = 3 or k = 4) branched junction molecules are used to form graphs. We present procedures for the 3-SAT and 3-vertex-colorability problems. Construction of one graph structure (in many copies) is suucient to determine the solution to the p...
متن کاملGraph Structures in DNA
We show that 3-dimensional graph structures can be used for solving computational problems with DNA molecules. Vertex building blocks consisting of k-armed (k = 3 or k = 4) branched junction molecules are used to form the graph. We present the solution to the 3-SAT problem and to the 3-vertex-colorability problem. Construction of one graph structure (in many copies) in both procedures is suucie...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملOn existence of reporter strands in DNA-based graph structures
Through self-assembly of branched junction molecules many different DNA structures (graphs) can be assembled. We show that every multigraph can be assembled by DNA such that there is a single strand that traces each edge in the graph at least once. This strand corresponds to a boundary component of a two-dimensional orientable surface that has the given graph as a deformation retract. This boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997